An Active Candidate Set Management Model for Realtime Association Rule Discovery
نویسندگان
چکیده
منابع مشابه
False Positive Item set Algorithm for Incremental Association Rule Discovery
In a dynamic database where the new transaction are inserted into the database, keeping patterns up-to-date and discovering new pattern are challenging problems of great practical importance. This may introduce new association rules and some existing association rules would become invalid. Thus, the maintenance of association rules for dynamic database is an important problem. In this paper, fa...
متن کاملLGen - A Lattice-Based Candidate Set Generation Algorithm for I/O Efficient Association Rule Mining
Most algorithms for association rule mining are variants of the basic Apriori algorithm One characteristic of these Apriori based algorithms is that candidate itemsets are generated in rounds with the size of the itemsets incremented by one per round The number of database scans required by Apriori based algorithms thus depends on the size of the largest large itemsets In this paper we devise a...
متن کاملFurther Pruning for Efficient Association Rule Discovery
The Apriori algorithm’s frequent itemset approach has become the standard approach to discovering association rules. However, the computation requirements of the frequent itemset approach are infeasible for dense data and the approach is unable to discover infrequent associations. OPUS AR is an efficient algorithm for association rule discovery that does not utilize frequent itemsets and hence ...
متن کاملOn Data Structures for Association Rule Discovery
The publisher does not give any warranty express or implied or make any representation that the contents will be complete or accurate or up to date. The accuracy of any instructions, formulae and drug doses should be independently verified with primary sources. The publisher shall not be liable for any loss, actions, claims, proceedings, demand or costs or damages whatsoever or howsoever caused...
متن کاملRule Discovery Based On Rough Set Theory
The volume of data being generated nowadays is increasingly large. How to extract useful information from such data collections is an important issue. A promising technique is the Rough set theory, a new mathematical approach to data analysis based on classification of objects of interest into similarity classes which are indiscernible with respect to some features. This theory offers two funda...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The KIPS Transactions:PartD
سال: 2002
ISSN: 1598-2866
DOI: 10.3745/kipstd.2002.9d.2.215